Path Control with Vector Decomposition

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

construction of vector fields with positive lyapunov exponents

in this thesis our aim is to construct vector field in r3 for which the corresponding one-dimensional maps have certain discontinuities. two kinds of vector fields are considered, the first the lorenz vector field, and the second originally introced here. the latter have chaotic behavior and motivate a class of one-parameter families of maps which have positive lyapunov exponents for an open in...

15 صفحه اول

The Rado Path Decomposition Theorem

Fix c : [N] → r, an r-coloring of the pairs of natural numbers. An ordered list of distinct integers, a0, a1, a2 . . . ai−1, ai, ai+1 . . . is a monochromatic path for color k, if, for all i ≥ 1, c({ai−1, ai}) = k. The empty list is considered a path of any color k. Similarly the list of one element, a0, is also considered a path of any color k. For any monochromatic path of length two or more ...

متن کامل

AL . : PATH DECOMPOSITION FOR COMPUTING BLOCKING PROBABILITIES IN WAVELENGTH ROUTING NETWORKS 1 A Path Decomposition

| We study a class of circuit-switched wavelength routing networks with xed or alternate routing and with random wavelength allocation. We present an iterative path decomposition algorithm to evaluate accurately and ee-ciently the blocking performance of such networks with and without wavelength converters. Our iterative algorithm analyzes the original network by decomposing it into single path...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEJ Transactions on Industry Applications

سال: 2000

ISSN: 0913-6339,1348-8163

DOI: 10.1541/ieejias.120.262